Averaging bounds for lattices and linear codes
نویسندگان
چکیده
منابع مشابه
Averaging bounds for lattices and linear codes
General random coding theorems for lattices are derived from the Minkowski–Hlawka theorem and their close relation to standard averaging arguments for linear codes over finite fields is pointed out. A new version of the Minkowski–Hlawka theorem itself is obtained as the limit, for , of a simple lemma for linear codes over GF used with -level amplitude modulation. The relation between the combin...
متن کاملNew asymptotic bounds for self-dual codes and lattices
We give an independent proof of the Krasikov-Litsyn bound d/n . (1−5)/2 on doubly-even self-dual binary codes. The technique used (a refinement of the Mallows-Odlyzko-Sloane approach) extends easily to other families of self-dual codes, modular lattices, and quantum codes; in particular, we show that the Krasikov-Litsyn bound applies to singly-even binary codes, and obtain an analogous bound fo...
متن کاملUpper Bounds for Modular Forms, Lattices, and Codes
Let W(z) = 1 + Ad ezmidr + AdCl ewrim+lM +. .. be a modular form of weight n for the full modular group. real part. This implies that there is no even unimodular lattice in E " , for n > n, , having minimum nonzero squared length > n/12-b. A similar argument shows that there is no binary self-dual code of length n > n, having all weights divisible by 4 and minimum nonzero weight > n/6-6. A corr...
متن کاملBounds for Unrestricted Codes , by Linear Programming
The paper describes a problem of linear programming associated with distance properties of unrestricted codes. As a solution to the problem, one obtains an .upper bound for the number of words in codes having a prescribed set of distances. 1. Introduetion Important information about a code is contained in its Hamming distance distribution, defined as follows: for a q-ary code C of length n, it ...
متن کاملBounds on Linear Codes for Network Multicast
Traditionally, communication networks are composed of routing nodes, which relay and duplicate data. Work in recent years has shown that for the case of multicast, an improvement in both rate and code-construction complexity can be gained by replacing these routing nodes by linear coding nodes. These nodes transmit linear combinations of the inputs transmitted to them. In this work, we deal wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1997
ISSN: 0018-9448
DOI: 10.1109/18.641543